搜索资源列表
Dome
- 1.采用链式结构实现任意多项式的存储,求两个多项式的和。 2.假设自上而下按层次,自左至右输入每个结点的一个三元组(D, P, L/R)。其中D为本结点的元素,P为其父结点,L指示D为P 的左孩子,R指示D为P的右孩子。试写一个建立二叉树在内存的双链表示算法,并实现先根、中根、后根以及层序遍历算法。 3.采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。-1 using an arbitrary polynomial chain structure of storag
YenTopKShortestPathsAlg
- 求解网络中前k条最短路径,并且考虑重复遍历的情况-YenTopKShortestPathsAlg Solving the network before the k shortest paths
Traveling-salesman
- 旅行商问题:全国省会二维坐标如图30所示,基于遗传算法设计从黑龙江到西藏,并遍历全国各省会(每个省会只经过一次)的最短路径-Traveling salesman problem: two-dimensional coordinates of the national capital as shown in Figure 30, based on genetic algorithm design from Heilongjiang to Tibet and traverse the provinc
learning-algorithm-code
- 有关数据结构的图的学习算法代码实现,最全包括:图的存储结构,图的遍历,拓扑排序,最小生成树和最短路径算法-The data structure of a learning algorithm code, the whole comprising: a storage structure chart, graph traversal, topological sorting, minimum spanning tree and the shortest path algorithm
main
- 1.掌握图的基本存储方法:邻接矩阵和邻接表(本程序中使用邻接矩阵); 2.掌握有关图的基本操作算法并能使用高级语言实现(本程序使用C语言); 3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法; 4.掌握图的最小生成树的两种算法:prim算法和kruskal算法。 5.掌握图的最短路径的两种算法:DIJ算法和floyd算法。 -1 The basic storage methods mastered graph: adjacency matrix and adjacency
0512
- 霍夫曼编码器、教学编制计划问题、图的遍历、自组织线性表、最短路径问题-Huffman encoder, teaching preparation program, graph traversal, self-organizing linear form, the shortest path problem
Graph
- VC++编写的数据结构图算法演示系统,可作毕业设计系统,包含深、广度遍历,最小生成树,拓扑排序,最短路径算法。-Graph algorithm operating system,include depth/breath first search,minitree,topsort,shortestpath.
software-design-I
- c++实现的非常详细的数据结构与算法代码,队列,链表,三元组,哈弗曼树,树的各种递归,非递归遍历算法,树与森林相互转化算法,图的深度,广度优先搜索算法,双连通算法,强连通算法,拓扑排序算法,最短路径算法,哈希,快速排序,归并排序等等。-C++ very detailed data structure and algorithm code, queues, linked lists, three tuple Havermann tree, various recursive tree, non r
XGraph
- 数据结构 有向网 对以邻接链表的方式存储的一个有向网 1.建立并显示出有向网的邻接链表; 2.对该有向网进行深度优先遍历(递归或非递归都可以),显示遍历的结果; 3.给出某一确定顶点到所有其它顶点的最短路径及其长度。-Data structure- to the network For storage in the form of adjacency list a directed network 1. Establish and shows have to mesh a
Graph
- 基于Virtual C++的数据结构中图的应用,能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出,同时能实现无向图的深度遍历输出和广度遍历输出;kruskal算法和Prim算法实现最小生成树的创建;Dijkstra算法实现最短路径的计算;以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs
shujujiegou
- 文件夹包含图的遍历完整代码和最短路径问题的完整代码,一共有三个word文件。-Folder contains the complete code traversal of the graph and the shortest path problem, a total of three word file.
Graph
- 图的存储、遍历、最短路径算法 图的DFS和BFS函数 Dijstra算法求最短路径-Graph storage traversal, shortest path algorithm graph DFS and BFS function Dijstra shortest path algorithm
6
- 《数据结构》 第6次上机题目 ( 图 练习 ) 1. 图的深度优先和广度优先遍历; 2.拓扑排序; 3. 关键路径练习(选做题); 4.最短路径练习(选做题)。-" Data Structure" depth first and breadth sixth title on the machine (Figure Exercise) 1. Graph traversal priority 2. Topological sorting 3. Critical
GraphPro
- 数据结构实验之图实验代码。实现了根据文本文件提供的信息创建图,实现图的最短路径搜索,遍历等功能。-Data structure experiment the figure of the code. Realized according to the text file to provide information to create diagrams, graph shortest path search, traversal, and other functions.
Astar_Romania
- 通过Astart算法了解对图结构、堆栈、队列、优先级队列等数据结构,并通过回溯过程解决罗马尼亚假日问题。问题内容是通过Astart算法,遍历所有节点(地点),寻找最短路径。-Astart algorithm to understand the structure of the map, stack, queue, priority queue and other data structures, and through the backtracking process to solve the
lv-xing-shang-wen-ti
- 基于遗传算法的TSP算法。本案例以14个城市为例,寻找出一条遍历14个城市的最短路径。-TSP Algorithm Based on Genetic Algorithm. In this case, 14 cities, for example, to find a traversal of the 14 cities in the shortest path.
GATraveller
- GAT旅行商,随机生成城市,一个出发点,最终回到初始点。遍历计算,求最短路径(GAT travel agents randomly generate cities, a starting point, and eventually back to the initial point. Traversal calculation, seek the shortest path)
图基本算法
- 图基本算法,包括存储、深度优先遍历,层次遍历,最短路径、最小生成树等(basic algorithm of graph)
ConsoleApplication2
- 用C语言实现了退火算法解决NP旅行商问题,遍历所有点走最短路径(Annealing algorithm to solve NP problem)
945649
- kruskal算法,实现图的遍历最短路径查找,本人的算法设计的一次实验,()